Experiments on Infinite Model Finding in SMT Solving

نویسندگان

چکیده

We propose infinite model finding as a new task for SMT-Solving. Model has long-standing tradition in SMT and automated reasoning general. Yet, most of the current tools are limited to finite models despite fact that many theories only admit models. This paper shows variety such problems evaluates synthesis approaches on them. Interestingly, state-of-the-art solvers fail even very small simple problems. target by SyGuS well heuristic approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint solving for finite model finding in SMT solvers

SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing SMT solvers to report “unknown” when they fail to prove the unsatisfiability of a formula with quantifiers. This inability to return counter-models limits thei...

متن کامل

Finite Model Finding in SMT

SMT solvers have been used successfully as reasoning engines for automated verification. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing SMT solvers to report “unknown” when they fail to prove the unsatisfiability of a formula with quantifiers. This inability to return counter-models limits their usefulness in applications that produce quantified...

متن کامل

Model Finding for Recursive Functions in SMT

SMT solvers have recently been extended with techniques for finding models in presence of universally quantified formulas in some restricted fragments. This paper introduces a translation which reduces axioms specifying a large class of recursive functions, including well-founded (terminating) functions, to universally quantified formulas for which these techniques are applicable. An empirical ...

متن کامل

SMT Solving for Functional Programming over Infinite Structures

We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints. Internally, such sets are represented by logical formulas that define them, and an external satisfiability modulo theories (SMT) solver is regularly run by the interpreter to che...

متن کامل

Implementation and Experiments of a Distributed SMT Solving Environment

SMT-based Bounded Model Checking (BMC) consists of two primary tasks: (1) encoding a bounded model checking problem into a propositional formula that represents the problem, and (2) using a SMT solver to solve the formula, that is, finding a set of variable assignments that makes the formula true. Solving the formula (namely, SMT solving) involves computation-intensive processes and is thus tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPiC series in computing

سال: 2023

ISSN: ['2398-7340']

DOI: https://doi.org/10.29007/slrm